Constructing Bloom filters by reconfigurable means for solving information security tasks
نویسندگان
چکیده
منابع مشابه
Robust Bloom Filters for Large MultiLabel Classification Tasks
This paper presents an approach to multilabel classification (MLC) with a large number of labels. Our approach is a reduction to binary classification in which label sets are represented by low dimensional binary vectors. This representation follows the principle of Bloom filters, a space-efficient data structure originally designed for approximate membership testing. We show that a naive appli...
متن کاملBloom filters
Bloom filters are used for answering queries on set membership. In this data structure, the whole element is not stored at the hashed address. Only a few bits are set in an array. Given a set S of cardinality n, we store it in an array of m bits using k hash functions h1(), . . . , hk(). Initially, all the cells in the array are set to 0. Then, for each element in the set, x ∈ S, for each 1 ≤ i...
متن کاملPerformance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters
Content-based routing is widely used in large-scale distributed systems as it provides a loosely-coupled yet expressive form of communication: consumers of information register their interests by the means of subscriptions, which are subsequently used to determine the set of recipients of every message published in the system. A major challenge of content-based routing is security. Although som...
متن کاملBloom Filters for Filesystem Forensics
Digital forensics investigations become more time consuming as the amount of data to be investigated grows. Secular growth trends between hard drive and memory capacity just exacerbate the problem. Bloom filters are space-efficient, probabilistic data structures that can represent data sets with quantifiable false positive rates that have the potential to alleviate the problem by reducing space...
متن کاملOptimizing Learned Bloom Filters by Sandwiching
We provide a simple method for improving the performance of the recently introduced learned Bloom filters, by showing that they perform better when the learned function is sandwiched between two Bloom filters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Scientific Journal of Information Security
سال: 2019
ISSN: 2411-071X,2225-5036
DOI: 10.18372/2225-5036.25.13594